Descriptional complexity of semi-conditional grammars

نویسندگان

  • Tomás Masopust
  • Alexander Meduna
چکیده

The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Descriptional Complexity of Semi-Conditional Grammars

The descriptional complexity of semi-conditional grammars is studied. A proof that every recursively enumerable language is generlji";'I":ff f iru*::?H:"ffi Xl,?li".ffi f iJ,,-,T?,ll,J"'"'n'"

متن کامل

Descriptional Complexity of Grammars Regulated by Context Conditions

This paper improves several well-known results concerning the descriptional complexity of grammars regulated by context conditions. Specifically, it proves that every recursively enumerable language is generated (A) by a context-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals, (B) by a generalized forbidding grammar of degree two with ...

متن کامل

Descriptional Complexity of Generalized Forbidding Grammars

This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.

متن کامل

Descriptional complexity of multi-parallel grammars

This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.

متن کامل

On Descriptional Complexity of Partially Parallel Grammars

This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 104  شماره 

صفحات  -

تاریخ انتشار 2007